Quantum Kolmogorov Complexity and Quantum Key Distribution

We discuss the Bennett-Brassard 1984 (BB84) quantum key distribution protocol in the light of quantum algorithmic information. While Shannon's information theory needs a probability to define a notion of information, algorithmic information theory does not need it and can assign a notion of information to an individual object. The program length necessary to describe an object, Kolmogorov complexity, plays the most fundamental role in the theory. In the context of algorithmic information theory, we formulate a security criterion for the quantum key distribution by using the quantum Kolmogorov complexity that was recently defined by Vit\'anyi. We show that a simple BB84 protocol indeed distribute a binary sequence between Alice and Bob that looks almost random for Eve with a probability exponentially close to 1.Comment: typos correcte

Invariant Measures and Decay of Correlations for a Class of Ergodic Probabilistic Cellular Automata

We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in the one dimensional case, we study some properties of the unique invariant measure and show that it is shift-mixing. Also, the decay of correlation is studied in detail. In this sense, the extended concept of duality gives exponential decay of correlation and allows to compute explicitily all the constants involved

Non-deterministic density classification with diffusive probabilistic cellular automata

We present a probabilistic cellular automaton (CA) with two absorbing states which performs classification of binary strings in a non-deterministic sense. In a system evolving under this CA rule, empty sites become occupied with a probability proportional to the number of occupied sites in the neighborhood, while occupied sites become empty with a probability proportional to the number of empty sites in the neighborhood. The probability that all sites become eventually occupied is equal to the density of occupied sites in the initial string.Comment: 4 pages, 4 figure

Phase Separation in One-Dimensional Driven Diffusive Systems

A driven diffusive model of three types of particles that exhibits phase separation on a ring is introduced. The dynamics is local and comprises nearest neighbor exchanges that conserve each of the three species. For the case in which the three densities are equal, it is shown that the model obeys detailed balance. The Hamiltonian governing the steady state distribution in this case is given and is found to have long range asymmetric interactions. The partition sum and bounds on some correlation functions are calculated analytically demonstrating phase separation.Comment: 4 Pages, Revtex, 2 Figures included, Submitted to Physical Review Letter

Spontaneous symmetry breaking: exact results for a biased random walk model of an exclusion process

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is manifested by the existence of a phase in which the densities of the two species are not equal. In order to provide a more rigorous basis to these observations we consider the limit of the process when the rate at which particles leave the system goes to zero. In this limit the process reduces to a biased random walk in the positive quarter plane, with specific boundary conditions. The stationary probability measure of the position of the walker in the plane is shown to be concentrated around two symmetrically located points, one on each axis, corresponding to the fact that the system is typically in one of the two states of broken symmetry in the exclusion process. We compute the average time for the walker to traverse the quarter plane from one axis to the other, which corresponds to the average time separating two flips between states of broken symmetry in the exclusion process. This time is shown to diverge exponentially with the size of the chain.Comment: 42 page

Roughening Transition in a One-Dimensional Growth Process

A class of nonequilibrium models with short-range interactions and sequential updates is presented. The models describe one dimensional growth processes which display a roughening transition between a smooth and a rough phase. This transition is accompanied by spontaneous symmetry breaking, which is described by an order parameter whose dynamics is non-conserving. Some aspects of models in this class are related to directed percolation in 1+1 dimensions, although unlike directed percolation the models have no absorbing states. Scaling relations are derived and compared with Monte Carlo simulations.Comment: 4 pages, 3 Postscript figures, 1 Postscript formula, uses RevTe

Fitness landscape of the cellular automata majority problem: View from the Olympus

In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is. We take an interest in the reasons that make this particular fitness landscape a difficult one. The first goal is to study the landscape as such, and thus it is ideally independent from the actual heuristics used to search the space. However, a second goal is to understand the features a good search technique for this particular problem space should possess. We statistically quantify in various ways the degree of difficulty of searching this landscape. Due to neutrality, investigations based on sampling techniques on the whole landscape are difficult to conduct. So, we go exploring the landscape from the top. Although it has been proved that no CA can perform the task perfectly, several efficient CAs for this task have been found. Exploiting similarities between these CAs and symmetries in the landscape, we define the Olympus landscape which is regarded as the ''heavenly home'' of the best local optima known (blok). Then we measure several properties of this subspace. Although it is easier to find relevant CAs in this subspace than in the overall landscape, there are structural reasons that prevent a searcher from finding overfitted CAs in the Olympus. Finally, we study dynamics and performance of genetic algorithms on the Olympus in order to confirm our analysis and to find efficient CAs for the Majority problem with low computational cost

Chaos and Complexity of quantum motion

The problem of characterizing complexity of quantum dynamics - in particular of locally interacting chains of quantum particles - will be reviewed and discussed from several different perspectives: (i) stability of motion against external perturbations and decoherence, (ii) efficiency of quantum simulation in terms of classical computation and entanglement production in operator spaces, (iii) quantum transport, relaxation to equilibrium and quantum mixing, and (iv) computation of quantum dynamical entropies. Discussions of all these criteria will be confronted with the established criteria of integrability or quantum chaos, and sometimes quite surprising conclusions are found. Some conjectures and interesting open problems in ergodic theory of the quantum many problem are suggested.Comment: 45 pages, 22 figures, final version, at press in J. Phys. A, special issue on Quantum Informatio